A Field Service Support System Using the Computer Analysis of Networks of Queues

نویسنده

  • H. T. Papadopoulos
چکیده

The Field Service (FS) Organization of many companies constitutes a vital Department playing an important role to their success. Field Service managers need some tools to analyse the impact of their decisions on customer service level, which must be as high as possible (at least 95%), and inventory cost, trying to reduce it to a minimum level (its ratio to the total FS revenue must be less than 10%). Such a tool is presented in this paper. We applied a closed queueing network model developed by Solberg, called CAN-Q (acronym for Computer Analysis of Networks of Queues). This model, although originally developed for modelling Flexible Manufacturing Systems, has been applied to the FS organization of a subsidiary of multinational computer company, in Greece, and it has proved to be very efficient from the computational point of view and constitutes a powerful tool for the FS managers, providing them with some useful performance measures. Its successful application gives rise to try some other queueing network models, available from the literature, in combination with various inventory control models to help FS managers solve their critical problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

Improving QoS in VANETs: A Survey

The systems in which information and communication technologies and systems engineering concepts are utilized to develop and improve transportation systems of all kinds are called “The Intelligent Transportation Systems (ITS)”. ITS integrates information, communications, computers and other technologies and uses them in the field of transportation to build an integrated system of people, roads ...

متن کامل

به‌دست آوردن میانگین زمان تکمیل‌پروژه در شبکه‌های پرت‌پویا‌ (سیستم چندپروژه‌ای) با ظرفیت محدود

In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...

متن کامل

HF-Blocker: Detection of Distributed Denial of Service Attacks Based On Botnets

Abstract—Today, botnets have become a serious threat to enterprise networks. By creation of network of bots, they launch several attacks, distributed denial of service attacks (DDoS) on networks is a sample of such attacks. Such attacks with the occupation of system resources, have proven to be an effective method of denying network services. Botnets that launch HTTP packet flood attacks agains...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006